Diffeomorphisms with discrete centralizer

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Open Sets of Diffeomorphisms with Trivial Centralizer in the C Topology

On the torus of dimension 2, 3, or 4, we show that the subset of diffeomorphisms with trivial centralizer in the C topology has nonempty interior. We do this by developing two approaches, the fixed point and the odd prime periodic point, to obtain trivial centralizer for an open neighbourhood of Anosov diffeomorphisms arbitrarily near certain irreducible hyperbolic toral automorphism.

متن کامل

Generalized twisted centralizer codes

An important code of length n is obtained by taking centralizer of a square matrix over a finite field Fq. Twisted centralizer codes, twisted by an element a ∈ Fq, are also similar type of codes but different in nature. The main results were embedded on dimension and minimum distance. In this paper, we have defined a new family of twisted centralizer codes namely generalized twisted centralizer...

متن کامل

Diffeomorphisms with Persistency

The C1 interior of the set of all diffeomorphisms satisfying Lewowicz’s persistency is characterized as the set of all diffeomorphisms satisfying Axiom A and the strong transversality condition. In [5], Lewowicz introduced a notion of persistency for a homeomorphism of a compact metric space X , and it is remarked that persistence is a weaker property than topological stability when X is a mani...

متن کامل

Diffeomorphisms with Periodic Shadowing

We show that if a diffeomorphism has the periodic shadowing property on the chain recurrent set, then the closure of the periodic set is the chain recurrent set. Mathematics Subject Classification: 37C50

متن کامل

Twisted Centralizer Codes

Given an n× n matrix A over a field F and a scalar a ∈ F , we consider the linear codes C(A, a) := {B ∈ F | AB = aBA} of length n2. We call C(A, a) a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when a = 1) is at most n, howe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology

سال: 1976

ISSN: 0040-9383

DOI: 10.1016/0040-9383(76)90003-3